Cloud Workflow Scheduling with Deadlines and Time Slot Availability
نویسندگان
چکیده
منابع مشابه
A Clustering Approach to Scientific Workflow Scheduling on the Cloud with Deadline and Cost Constraints
One of the main features of High Throughput Computing systems is the availability of high power processing resources. Cloud Computing systems can offer these features through concepts like Pay-Per-Use and Quality of Service (QoS) over the Internet. Many applications in Cloud computing are represented by workflows. Quality of Service is one of the most important challenges in the context of sche...
متن کاملPredictive Probabilistic Resource Availability based Cloud Workflow Scheduling (PPRA)
Cloud Computing provides access to a shared pool of computing resources such as servers, storage, computer networks and services, which can be rapidly provisioned and released, for the execution of various scientific and business applications. Scheduling scientific workflows modeled by Directed Acyclic Graphs is an NP complete problem. In cloud environment, there are fluctuations in resource av...
متن کاملa clustering approach to scientific workflow scheduling on the cloud with deadline and cost constraints
one of the main features of high throughput computing systems is the availability of high power processing resources. cloud computing systems can offer these features through concepts like pay-per-use and quality of service (qos) over the internet. many applications in cloud computing are represented by workflows. quality of service is one of the most important challenges in the context of sche...
متن کاملWorkflow Scheduling in Cloud Computing
Cloud Computing offers wide computation and resource facilities for execution of various application workflows. Many different resources involved in execution of single workflow. Cloud Computing offers highly dynamic environment in which the system load and status of resource changes frequently. As the workload increases with increase in Cloud Services and clients there is a need to handle thes...
متن کاملOnline real-time preemptive scheduling of jobs with deadlines
In this paper, we derive bounds on performance guarantees of online algorithms for real-time preemptive scheduling of jobs with deadlines on K machines when jobs are characterized in terms of their minimum stretch factor α (or, equivalently, their maximum execution rate r = 1/α). We consider two well known preemptive models that are of interest from practical applications: the hard real-time sc...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Services Computing
سال: 2018
ISSN: 1939-1374,2372-0204
DOI: 10.1109/tsc.2016.2518187